A-graded methods for monomial ideals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A-graded Methods for Monomial Ideals

We use Z-gradings to study d-dimensional monomial ideals. The Koszul functor is employed to interpret the quasidegrees of local cohomology in terms of the geometry of distractions and to explicitly compute the multiplicities of exponents. These multigraded techniques originate from the study of hypergeometric systems of differential equations.

متن کامل

Monomial Ideals

Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic geometry.

متن کامل

Monomial ideals , edge ideals of hypergraphs , and their graded Betti numbers

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub...

متن کامل

Monomial Ideals, Edge Ideals of Hypergraphs, and Their Minimal Graded Free Resolutions

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub...

متن کامل

Reverse search for monomial ideals

We give a set of multidegrees that support all the numerical information for a monomial ideal that can be reverse searched and hence is parallelizable and has space complexity that is polynomial in the size of the input. Our approach uses a new definition of closed sets for simplicial complexes that may be useful in other contexts.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2009

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2009.07.007